Type Preorders and Recursive Terms

نویسندگان

Fabio Alessi

Mariangiola Dezani-Ciancaglini

چکیده

We show how to use intersection types for building models of a λ-calculus enriched with recursive terms, whose intended meaning is of minimal fixed points. As a by-product we prove an interesting consistency result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing Finitary Probabilistic Processes

We provide both modaland relational characterisations of mayand must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topological pr...

متن کامل

Testing Finitary Probabilistic Processes: DRAFT

This paper provides modaland relational characterisations of mayand must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topologica...

متن کامل

Simple Termination Revisited

In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpliication order. The basic ingredient of a simpliication order is the subterm property, but in the literature two diierent deenitions are given: one based on (strict) partial orders and another one based on preorders (or quasi-or...

متن کامل

Inverse Limit Models as Filter Models

Natural intersection type preorders are the type structures which agree with the plain intuition of intersection type constructor as set-theoretic intersection operation and arrow type constructor as set-theoretic function space constructor. In this paper we study the relation between natural intersection type preorders and natural λ-structures, i.e. ω-algebraic lattices D with Galois connectio...

متن کامل